Auction-Based Multi-Robot Routing
نویسندگان
چکیده
Recently, auction methods have been investigated as effective, decentralized methods for multi-robot coordination. Experimental research has shown great potential, but has not been complemented yet by theoretical analysis. In this paper we contribute a theoretical analysis of the performance of auction methods for multi-robot routing. We suggest a generic framework for auction-based multi-robot routing and analyze a variety of bidding rules for different team objectives. This is the first time that auction methods are shown to offer theoretical guarantees for such a variety of bidding rules and team objectives.
منابع مشابه
Optimized Algorithms for Multi-Agent Routing (Short Paper)
Auction methods have been successfully used for coordinating teams of robots in the multi-robot routing problem, a representative domain for multi-agent coordination. Solutions to this problem typically use bids computed using the shortest distance between various locations on a map. But, the cost of this shortest-distance computation has not been considered in previous research. This paper pre...
متن کاملAuction Aggregation Protocols for Wireless Robot-Robot Coordination
Robots coordinate among themselves to select one of them to respond to an event reported to one of robots. The goal is to minimize the communication cost of selecting best robot, response time, and cost of performing the task. Existing solutions are either centralized, neglecting communication cost, assuming complete graph, or based on flooding with individual responses to robot decision maker ...
متن کاملAuctioning robotic tasks with overlapping time windows
This work investigates allocation of tasks to multi-robots when tasks are spatially distributed and constrained to be executed within assigned time windows. Our work explores the interaction between scheduling and optimal routing. We propose the Time-Sensitive Sequential Single-Item Auction algorithm as a method to allocate tasks with time windows in multi-robot systems. We show, experimentally...
متن کاملA Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms
Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...
متن کاملEfficient Market Mechanisms and Simulation-based Learning for Multi-Agent Systems
This dissertation has two independent theses. In the first part, we study the design auction-based distributed mechanisms for resource allocation in multi-agent systems such as bandwidth allocation, network routing, electronic marketplaces, robot teams, and air-traffic control. The work is motivated by a resource allocation problem in communication networks where there are buyers and sellers of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005